A polynomial time solution for 2-SAT
نویسنده
چکیده
The question of whether the P and NP complexity classes are equivalent is unresolved. It is conjectured that they are inequivalent because of the vast number of NP-Complete languages (including the ever-popular 3-SAT) for which there is no known polynomial time solution. The author of this paper respectfully disagrees and presents a polynomial time solution to a problem closely related to 3-SAT: 2-SAT.
منابع مشابه
Errors in Improved Polynomial Algorithm For 3 Sat Proposed By Narendra Chaudhari
There are errors in the algorithm proposed by Narendra Chaudhari [2] purporting to solve the 3-sat problem in polynomial time. The present paper presents an instance for which the algorithm outputs erroneous results. Introduction: In his paper [1], Narendra Chaudhari describes an algorithm to find a solution for the 3-sat problem in polynomial time. In a second paper [2], he improves on his pre...
متن کامل2 7 A ug 2 00 8 Analysis of the postulates produced by Karp ’ s
This is the final article in a series of four articles. Richard Karp has proven that a deterministic polynomial time solution to K-SAT will result in a deterministic polynomial time solution to all NP-Complete problems. However, it is demonstrated that a deterministic polynomial time solution to any NP-Complete problem does not necessarily produce a deterministic polynomial time solution to all...
متن کامل. C C ] 2 5 A ug 2 00 8 Analysis of the postulates produced by Karp ’ s Theorem
This is the final article in a series of four articles. Richard Karp has proven that a deterministic polynomial time solution to K-SAT will result in a deterministic polynomial time solution to all NP-Complete problems. However, it is demonstrated that a deterministic polynomial time solution to any NP-Complete problem does not necessarily produce a deterministic polynomial time solution to all...
متن کامل2 4 A ug 2 00 8 Analysis of the postulates produced by Karp ’ s
This is the final article in a series of four articles. Richard Karp has proven that a deterministic polynomial time solution to K-SAT will result in a deterministic polynomial time solution to all NP-Complete problems. However, it is demonstrated that a deterministic polynomial time solution to any NP-Complete problem does not necessarily produce a deterministic polynomial time solution to all...
متن کاملA ug 2 00 8 Analysis of the postulates produced by Karp ’ s
This is the final article in a series of four articles. Richard Karp has proven that a deterministic polynomial time solution to K-SAT will result in a deterministic polynomial time solution to all NP-Complete problems. However, it is demonstrated that a deterministic polynomial time solution to any NP-Complete problem does not necessarily produce a deterministic polynomial time solution to all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016